Tsukuba Termination Tool

We present a tool for automatically proving termination of first-order rewrite systems. The tool is based on the dependency pair method of Arts and Giesl [1]. It incorporates several new ideas that make the method more efficient. The tool produces high-quality output and has a convenient web interface. If TTT succeeds in proving termination, it outputs a proof script which explains in considerable detail how termination was proved. This script is available in both HTML and LTEX format. In the latter, the approximated dependency graph is visualized using the dot tool of the Graphviz toolkit. TTT is written in Objective Caml. We tested the various options of TTT on numerous examples. The results, as well as a comparison with other tools that implement the dependency pair method and some implementation details, can be found in [2, 3]. We describe some of the features of the tool (TTT in the sequel) by means of its web interface, displayed in Fig. 1.